Extended Skolem type difference sets

نویسندگان

  • Tina Helms
  • Heather Jordon
  • Maggie Murray
  • Stephanie Zeppetello
چکیده

A k-extended Skolem-type 5-tuple difference set of order t is a set of t 5-tuples {(di,1, di,2, di,3, di,4, di,5) | i = 1, 2, . . . , t} such that di,1+di,2+di,3+di,4+di,5 = 0 for 1 ≤ i ≤ t and {|di,j| | 1 ≤ i ≤ t, 1 ≤ j ≤ 5} = {1, 2, . . . , 5t+1}\{k}. In this talk, we will give necessary and sufficient conditions on t and k for the existence of a k-extended Skolem-type 5-tuple difference set of order t. We also consider hooked k-extended Skolem-type 5-tuple difference sets of order t and provide necessary and sufficient conditions for their existence. We will then show how these k-extended Skolem-type difference sets can be used to find decompositions of circulant and complete graphs of order n into 5-cycles, d-cycles, where d is a divisor of n, Hamilton cycles, and possibly a 1-factor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skolem Odd Difference Mean Graphs

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

متن کامل

Exponential lower bounds for the numbers of Skolem-type sequences

It was shown by Abrham that the number of pure Skolem sequences of order n, n ≡ 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2bn/3c. These results are extended to give similar lower bounds for the numbers of hooked Skolem sequences, split Skolem sequences and split-hooked Skolem sequences.

متن کامل

NP-completeness of generalized multi-Skolem sequences

A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets of the form A = {1, . . . , n} are Skolem sets was solved by Thoralf Skolem [6] in 195...

متن کامل

Perfect Skolem sets

A Skolem sequence is a sequence s1, s2, . . . , s2n (where si ∈ A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The problem of deciding which sets of the form A = {1 . . . n} are Skolem sets was solved by Thoralf Skolem in the late 1950’s. We stud...

متن کامل

Beyond Skolem Chase: A Study of Finite Chase under Standard Chase Variant

The chase procedure is an indispensable tool for several database applications, where its termination guarantees decidability of these tasks. Most previous studies have focused on the skolem chase variant and its termination. It is known that the standard chase variant is more powerful in termination analysis provided a database is given. But all-instance termination analysis presents a challen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2012